Epistemic Reasoning in Logic Programs
نویسنده
چکیده
Although epistemic logic programming has an enhanced capacity to handle complex incomplete information reasoning and represent agents’ epistemic behaviours, it embeds a significantly higher computational complexity than non-disjunctive and disjunctive answer set programming. In this paper, we investigate some important properties of epistemic logic programs. In particular, we show that Lee and Lifschitz’s result on loop formulas for disjunctive logic programs can be extended to a special class of epistemic logic programs. We also study the polysize model property for epistemic logic programs. Based on these discoveries, we identify two non-trivial classes of epistemic logic programs whose consistency checking complexity is reduced from PSPACE-complete to NP-complete and Σ2 -complete respectively. We observe that many important applications on epistemic representation fall into these two classes of epistemic logic programs.
منابع مشابه
Computational Properties of Epistemic Logic Programs
Gelfond’s epistemic logic programs are not only an extension of disjunctive extended logic programs for handling difficulties in reasoning with incomplete information, but also an effective formalism to represent agents’ epistemic reasoning under a logic programming setting. Recently there is an increasing research in this direction. However, for many years the complexity of epistemic logic pro...
متن کاملModeling Epistemic Knowledge about Users
Representing what an intelligent agent knows or believes can be an important feature for an entity that acts in a collaborative environment. Epistemic logic programs are a clear way to reason about what an intelligent agent knows or believes, but the complexity of the reasoning is exponential. The paper presents a new kind of logic programs, the logic programs with two types of negation as fail...
متن کاملReasoning about Dynamic Epistemic Logic
We present an algebra and sequent calculus to reason about dynamic epistemic logic, a logic for information update in multi-agent systems. We contribute to it by equipping it with a logical account of resources, a semi-automatic way of reasoning through the algebra and sequent calculus, and finally by generalizing it to non-boolean settings. Dynamic Epistemic Logic (DEL) is a PDL-style logic [1...
متن کاملProof Theory of Epistemic Logic of Programs
A combination of epistemic logic and dynamic logic of programs is presented. Although rich enough to formalize some simple game-theoretic scenarios, its axiomatization is problematic as it leads to the paradoxical conclusion that agents are omniscient. A cut-free labelled Gentzen-style proof system is then introduced where knowledge and action, as well as their combinations, are formulated as r...
متن کاملModeling epistemic knowledge in logic programs with negation as failure
Representing what an intelligent agent knows or believes can be an important feature for a Web service. Epistemic logic programs proposed by Gelfond [6] are a clear way to reason about what an intelligent agent knows or believes, but the complexity of the reasoning is exponential. The paper proposes a new class of logic programs, which consists from logic programs with two types of negation as ...
متن کامل